ϕ-symmetric Hamilton cycle decompositions of graphs
نویسندگان
چکیده
منابع مشابه
Symmetric Hamilton cycle decompositions of complete multigraphs
Let n ≥ 3 and λ ≥ 1 be integers. Let λKn denote the complete multigraph with edge-multiplicity λ. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of λK2m for all even λ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of λK2m − F for all odd λ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki...
متن کاملSymmetric Hamilton Cycle Decompositions of Complete Graphs Minus a 1-Factor
Let n ≥ 2 be an integer. The complete graph Kn with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that Kn − F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n ≡ 2, 4 mod 8. We also show that the complete bipartite graph Kn,n has a symmetric Hamilton cycle decomposition if and only if n ...
متن کاملPaley graphs have Hamilton decompositions
We prove that all Paley graphs can be decomposed into Hamilton cycles.
متن کاملHamilton decompositions of graphs with primitive complements
A k-factor of a graph is a k-regular spanning subgraph. A Hamilton cycle is a connected 2-factor. A graph G is said to be primitive if it contains no k-factor with 1 ≤ k < ∆(G). A Hamilton decomposition of a graph G is a partition of the edges of G into sets, each of which induces a Hamilton cycle. In this paper, by using the amalgamation technique, we find necessary and sufficient conditions f...
متن کاملCounting Hamilton decompositions of oriented graphs
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamiltonian decomposition of G is a partition of its edge set into disjoint Hamilton cycles. In the late 60s Kelly conjectured that every regular tournament has a Hamilton decomposition. This conjecture was recently settled by Kühn and Osthus [15], who proved more generally that every r-regular n-vertex o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.04.008